#include "priority_queue.h"

int main()
{

	//priority_queue<int, vector<int>, szl::Less<int>> pq;
	/*szl::priority_queue<int> pq;
	pq.push(1);
	pq.push(6);
	pq.push(3);
	pq.push(2);
	pq.push(7);
	pq.push(5);

	while (!pq.empty())
	{
		cout << pq.top() << endl;
		pq.pop();
	}
	cout << endl;*/

	vector<int> v{ 1,3,5,2,6 };
	priority_queue<int> pq(v.begin(), v.end());

	while (!pq.empty())
	{
		cout << pq.top() << endl;
		pq.pop();
	}
	cout << endl;

	return 0;
}